Recognition polynomials
نویسندگان
چکیده
This paper deals with one aspect of the problem of object recognition, viz., the recognition of configurations. A configuration is a three-dimensional arrangement of an arbitrary number of labeled feature points. We present a computationally simple method whereby a configuration can be recognized in an infinite variety of orthographic views after being seen in only one orthographic view. The method involves simply evaluating a polynomial and requires no depth coordinates of the feature points to be given or computed. The method can, in principle, lead to recognition polynomials for configurations viewed under perspective projections, but this has not yet been done.
منابع مشابه
Optimization of Formant Feature Based Speech Recognition
The paper deals with the use of formant features in dynamic time warping based speech recognition. These features can be simply visualized and give a new insight into understanding the reasons of speech recognition errors. The formant feature extraction method, based on the singular prediction polynomials, has been applied in recognition of isolated words. However, the speech recognition perfor...
متن کاملUsing Polynomial Networks for Speech Recognition
We consider the problem of using polynomial networks for speech recognition. Previous applications of polynomials to speech recognition have yielded systems which are difficult to train and have only moderate accuracy. We show that through a novel training algorithm, a probabilistic interpretation, and a novel scoring method, polynomials networks can be applied to speech recognition in a manner...
متن کاملCombining implicit polynomials and geometric features for hand recognition
Person identification and verification using biometric methods is getting more and more important in today’s information society. Hand recognition is a promising biometric because of its simplicity and fairly good performance of verification. In this work, implicit polynomials, which have proven to be very successful in object modeling and recognition, have been proposed for recognizing hand sh...
متن کاملImage representation using separable two-dimensional continuous and discrete orthogonal moments
This paper addresses bivariate orthogonal polynomials, which are a tensor product of two different orthogonal polynomials in one variable. These bivariate orthogonal polynomials are used to define several new types of continuous and discrete orthogonal moments. Some elementary properties of the proposed continuous Chebyshev–Gegenbauer moments (CGM), Gegenbauer–Legendre moments (GLM), and Chebys...
متن کاملHolistic Face Recognition using Multivariate Approximation, Genetic Algorithms and AdaBoost Classifier: Preliminary Results
Several works regarding facial recognition have dealt with methods which identify isolated characteristics of the face or with templates which encompass several regions of it. In this paper a new technique which approaches the problem holistically dispensing with the need to identify geometrical characteristics or regions of the face is introduced. The characterization of a face is achieved by ...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Recognition of 3D Objects Based on Implicit Polynomials
This work deals with 3D objects description and recognition by implicit polynomials (IPs). We explore the description abilities of existing 3D implicit polynomials fitting algorithms, Gradient-One, Min-Max and Min-Var, and suggest a modification for the Min-Max and Min-Var algorithms, so that they will be rotation invariant. We develop a new set of 3D rotation invariants that are linear combina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002